Modeling algorithmic bias: simplicial complexes and evolving network topologies

نویسندگان

چکیده

Abstract Every day, people inform themselves and create their opinions on social networks. Although these platforms have promoted the access dissemination of information, they may expose readers to manipulative, biased, disinformative content—co-causes polarization/radicalization. Moreover, recommendation algorithms, intended initially enhance platform usage, are likely augment such phenomena, generating so-called Algorithmic Bias . In this work, we propose two extensions model analyze them scale-free Erdős–Rényi random network topologies. Our first extension introduces a mechanism link rewiring so that underlying structure co-evolves with opinion dynamics, Adaptive model. The second one explicitly models peer-pressure where majority—if there is one—can attract disagreeing individual, pushing conform. As result, observe co-evolution does not significantly impact final state when latter much slower than former. On other hand, peer pressure enhances consensus mitigating effects both “close-mindedness” algorithmic filtering.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolving Neural Network through Augmenting Topologies

An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixed-topology method on a challenging benchmark reinforcement learning task. We claim that the increased efficiency is due to (1) employing a principled method of crossover...

متن کامل

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

Completions and Simplicial Complexes

We first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. We show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈CUP〉 and 〈CAP〉, in order to define, in an axiomatic way, a remarkable collection of acyclic...

متن کامل

Simplicial Complexes and Spaces

The notion of simplicial complexes is usually introduced at the graduate level, as part of the study of algebraic topology. So the main objective of this paper is to organize and present materials found in the literature so that it is accessible to students at the undergraduate level. We first generalize linear algebra to affine linear algebra. Then using these results, we define, and subsequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Network Science

سال: 2022

ISSN: ['2364-8228']

DOI: https://doi.org/10.1007/s41109-022-00495-7